MOODS: fast search for position weight matrix matches in DNA sequences
نویسندگان
چکیده
منابع مشابه
MOODS: fast search for position weight matrix matches in DNA sequences
UNLABELLED MOODS (MOtif Occurrence Detection Suite) is a software package for matching position weight matrices against DNA sequences. MOODS implements state-of-the-art online matching algorithms, achieving considerably faster scanning speed than with a simple brute-force search. MOODS is written in C++, with bindings for the popular BioPerl and Biopython toolkits. It can easily be adapted for ...
متن کاملThe statistical significance of nucleotide position-weight matrix matches
MOTIVATION To improve the detection of nucleotide sequence signals (e.g. promoter elements) by position-weight matrices (PWM) using the concept of statistically significant matches. RESULTS The Mksite program was originally developed for analyzing protein sequences. We report NMksite, a new version adapted to the processing of nucleotide sequences. NMksite creates PWM from nucleotide sequence...
متن کاملa fast algorithm for exonic regions prediction in dna sequences
the main purpose of this paper is to introduce afast method for gene prediction in dna sequences based on the period-3 property in exons. first, the symbolic dna sequences are converted to digital signal using the eiip method. then, to reduce the effect of background noise in the period-3 spectrum, we use the discrete wavelet transform (dwt) at three levels and apply it on the input digital sig...
متن کاملOn counting position weight matrix matches in a sequence, with application to discriminative motif finding
MOTIVATION AND RESULTS The position weight matrix (PWM) is a popular method to model transcription factor binding sites. A fundamental problem in cis-regulatory analysis is to "count" the occurrences of a PWM in a DNA sequence. We propose a novel probabilistic score to solve this problem of counting PWM occurrences. The proposed score has two important properties: (1) It gives appropriate weigh...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2009
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btp554